Low-Power Approximate RPR Scheme for Unsigned Integer Arithmetic Computation
نویسندگان
چکیده
A scheme often used for error tolerance of arithmetic circuits is the so-called Reduced Precision Redundancy (RPR). Rather than replicating multiple times entire module, RPR uses reduced precision (inexact) copies to significantly reduce redundancy overhead, while still being able correct largest errors. This paper focuses on low-power operation RPR; a new proposed. At circuit level, power gating initially utilized in modules off one (i.e., exact module) when inexact modules’ smaller threshold. The proposed design applicable (unsigned integer) addition, multiplication, and MAC (multiply add) by proposing implementations that consumption with limited impact its correction capability. schemes have been implemented tested various applications (image DCT processing). results show they can consumption; moreover, simulation Mean Square Error (MSE) at schemes’ output low.
منابع مشابه
A Low Power Full Adder Cell based on Carbon Nanotube FET for Arithmetic Units
In this paper, a full adder cell based on majority function using Carbon-Nanotube Field-Effect Transistor (CNFET) technology is presented. CNFETs possess considerable features that lead to their wide usage in digital circuits design. For the design of the cell input capacitors and inverters are used. These kinds of design method cause a high degree of regularity and simplicity. The proposed des...
متن کاملRewrite Systems for Integer Arithmetic
H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...
متن کاملRewrite systems for integer arithmetic
H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...
متن کاملRewrite systems for integer arithmetic
H.Zantema Utrecht University, Compo Sc. Dept. P.O. Box 80.089, 3508 TB Utrecht [email protected] We present three term rewrite systems for integer arithmetic with addition, multiplication, and, in two cases, subtraction. All systems are ground confluent and terminating; termination is proved by semantic labelling and recursive path order. The first system represents numbers by successor and prede...
متن کاملVariable Word Width Computation for Low Power
Today’s mobile processors must often times tackle a multitude of computing applications, many of which do not require the full 32-bit data word for their computations. In light of this, it is possible to restrict the computations for these applications to a reduced width data word to minimize power consumption. A modification to a standard RISC architecture is presented to reduce the overall po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE open journal of nanotechnology
سال: 2022
ISSN: ['2644-1292']
DOI: https://doi.org/10.1109/ojnano.2022.3153329